Randomized mutual exclusion on a multiple access channel
نویسندگان
چکیده
منابع مشابه
RMR-Efficient Randomized Abortable Mutual Exclusion
Recent research on mutual exclusion for shared-memory systems has focused on local spinalgorithms. Performance is measured using the remote memory references (RMRs) metric. Ascommon in recent literature, we consider a standard asynchronous shared memory model withN processes, which allows atomic read, write and compare-and-swap (short: CAS) operations.In such a model, the asympt...
متن کاملNondominated k-Coteries for Multiple Mutual Exclusion
Quorum-based mutual exclusion algorithms are resilient to node and communication line failures. In order to enter its critical section, a node must obtain permission from a quorum of nodes. A collection of quorums is called a coterie. The most resilient coteries are called nondominated coteries. Recently, k-coteries were proposed to be used in mutual exclusion algorithms that allow up to k entr...
متن کاملWhen does a correct mutual exclusion algorithm guarantee mutual exclusion?
Dijkstra introduced mutual exclusion for an N -process system as the requirement “that at any moment only one of these N cyclic processes is in its critical section” [1]. This requirement, which we call true mutual exclusion, is still the standard definition of mutual exclusion. Mutual exclusion algorithms for shared-memorymultiprocessors do not guarantee true mutual exclusion. We give a simple...
متن کاملStochastic Games on a Multiple Access Channel
We consider a scenario where N users try to access a common base station. Associated with each user is its channel state and a finite queue which varies with time. Each user chooses his power and the admission control variable in a dynamic manner so as to maximize his expected throughput. The throughput of each user is a function of the actions and states of all users. The scenario considers th...
متن کاملInterleaver-Division Multiple Access on the OR Multiple Access Channel
The OR channel provides an unusual opportunity where single-user decoding permits operation at about 70% of the full multiple-access channel sum capacity. The interleaverdivision multiple access technique applied in this paper can approach that performance with turbo and LDPC solutions. The current paper focuses on very low latency codes with simple Viterbi decoding, intended for very high spee...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Distributed Computing
سال: 2016
ISSN: 0178-2770,1432-0452
DOI: 10.1007/s00446-016-0265-z